Closing the Gap for Makespan Scheduling via Sparsification

Makespan scheduling on identical machines is one of the most basic and fundamental packing problem studied in the discrete optimization literature. It asks for an assignment of n jobs to a set of m identical machines that minimizes the makespan. The problem is strongly NPhard, and thus we do not expect a (1 + ε)-approximation algorithm with a running time that depends polynomially on 1/ε. Furthermore, Chen et al. [3] recently showed that a running time of 2(1/ε) + poly(n) for any δ > 0 would imply that the Exponential Time Hypothesis (ETH) fails. A long sequence of algorithms have been developed that try to obtain low dependencies on 1/ε, the better of which achieves a running time of 2Õ(1/ε) + O(n logn) [10]. In this paper we obtain an algorithm with a running time of 2Õ(1/ε) +O(n logn), which is tight under ETH up to logarithmic factors on the exponent. Our main technical contribution is a new structural result on the configuration-IP. More precisely, we show the existence of a highly symmetric and sparse optimal solution, in which all but a constant number of machines are assigned a configuration with small support. This structure can then be exploited by integer programming techniques and enumeration. We believe that our structural result is of independent interest and should find applications to other settings. In particular, we show how the structure can be applied to the minimum makespan problem on related machines and to a larger class of objective functions on parallel machines. For all these cases we obtain an efficient PTAS with running time 2Õ(1/ε) + poly(n). 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems